The Omphalos Context-Free Grammar Learning Competition
Identifieur interne : 00A835 ( Main/Exploration ); précédent : 00A834; suivant : 00A836The Omphalos Context-Free Grammar Learning Competition
Auteurs : Bradford Starkie [Australie] ; François Coste [France] ; Menno Van Zaanen [Pays-Bas]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2004.
Descripteurs français
- Pascal (Inist)
- Wicri :
- topic : Intelligence artificielle.
English descriptors
- KwdEn :
- Algorithm, Artificial intelligence, Benchmark inference problems, Benchmark problems, Bradford starkie, Bruteforcelearner, Bruteforcelearner algorithm, Candidate grammars, Center recursion, Competition problems, Competition task, Competition tasks, Complexity measure, Context free grammar, Context free language, Derivation trees, Deterministic languages, Distance measure, Equal number, Erik tjong, Evaluation approach, Grammar, Grammatical, Grammatical inference, Grammatical inference algorithms, Grammatical inference problems, Grammatical inference systems, Indicative measure, Inference algorithms, Inference problems, International colloquium, Joan andreu, Lecture notes, Longest sentence, Main disadvantage, Menno, More task, Negative data, Negative examples, Negative sentences, Omphalos, Omphalos competition, Omphalos grammar, Pages berlin heidelberg, Polynomial time, Positive data, Positive examples, Positive sentences, Previous section, Regular approximation, Regular approximations, Regular language, Right hand side, Statistical distribution, Suitable measure, Target grammar, Target grammars, Target language, Telstra research laboratories, Test data, Test examples, Test sentence, Test sentences, Test sets, Testing sets, Training data, Training examples, Training sentences, Training sets, Unseen examples, Unstructured data, Zaanen.
- Teeft :
- Algorithm, Benchmark inference problems, Benchmark problems, Bradford starkie, Bruteforcelearner, Bruteforcelearner algorithm, Candidate grammars, Center recursion, Competition problems, Competition task, Competition tasks, Complexity measure, Derivation trees, Deterministic languages, Distance measure, Equal number, Erik tjong, Evaluation approach, Grammar, Grammatical, Grammatical inference, Grammatical inference algorithms, Grammatical inference problems, Grammatical inference systems, Indicative measure, Inference algorithms, Inference problems, International colloquium, Joan andreu, Lecture notes, Longest sentence, Main disadvantage, Menno, More task, Negative data, Negative examples, Negative sentences, Omphalos, Omphalos competition, Omphalos grammar, Pages berlin heidelberg, Polynomial time, Positive data, Positive examples, Positive sentences, Previous section, Regular approximation, Regular approximations, Regular language, Right hand side, Statistical distribution, Suitable measure, Target grammar, Target grammars, Target language, Telstra research laboratories, Test data, Test examples, Test sentence, Test sentences, Test sets, Testing sets, Training data, Training examples, Training sentences, Training sets, Unseen examples, Unstructured data, Zaanen.
Abstract
Abstract: This paper describes the Omphalos Context-Free Grammar Learning Competition held as part of the International Colloquium on Grammatical Inference 2004. The competition was created in an effort to promote the development of new and better grammatical inference algorithms for context-free languages, to provide a forum for the comparison of different grammatical inference algorithms and to gain insight into the current state-of-the-art of context-free grammatical inference algorithms. This paper discusses design issues and decisions made when creating the competition. It also includes a new measure of the complexity of inferring context-free grammars, used to rank the competition problems.
Url:
DOI: 10.1007/978-3-540-30195-0_3
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 002D34
- to stream Istex, to step Curation: 002D34
- to stream Istex, to step Checkpoint: 001907
- to stream Main, to step Merge: 00B492
- to stream PascalFrancis, to step Corpus: 004B48
- to stream PascalFrancis, to step Curation: 001555
- to stream PascalFrancis, to step Checkpoint: 004905
- to stream Main, to step Merge: 00B732
- to stream Main, to step Curation: 00A835
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct:series"><teiHeader><fileDesc><titleStmt><title xml:lang="en">The Omphalos Context-Free Grammar Learning Competition</title><author><name sortKey="Starkie, Bradford" sort="Starkie, Bradford" uniqKey="Starkie B" first="Bradford" last="Starkie">Bradford Starkie</name></author><author><name sortKey="Coste, Francois" sort="Coste, Francois" uniqKey="Coste F" first="François" last="Coste">François Coste</name></author><author><name sortKey="Van Zaanen, Menno" sort="Van Zaanen, Menno" uniqKey="Van Zaanen M" first="Menno" last="Van Zaanen">Menno Van Zaanen</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:F0B6C29F334B3E9B4D717E769FB77011760B3852</idno><date when="2004" year="2004">2004</date><idno type="doi">10.1007/978-3-540-30195-0_3</idno><idno type="url">https://api.istex.fr/document/F0B6C29F334B3E9B4D717E769FB77011760B3852/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">002D34</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">002D34</idno><idno type="wicri:Area/Istex/Curation">002D34</idno><idno type="wicri:Area/Istex/Checkpoint">001907</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001907</idno><idno type="wicri:doubleKey">0302-9743:2004:Starkie B:the:omphalos:context</idno><idno type="wicri:Area/Main/Merge">00B492</idno><idno type="wicri:source">INIST</idno><idno type="RBID">Pascal:05-0042339</idno><idno type="wicri:Area/PascalFrancis/Corpus">004B48</idno><idno type="wicri:Area/PascalFrancis/Curation">001555</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">004905</idno><idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">004905</idno><idno type="wicri:doubleKey">0302-9743:2004:Starkie B:the:omphalos:context</idno><idno type="wicri:Area/Main/Merge">00B732</idno><idno type="wicri:Area/Main/Curation">00A835</idno><idno type="wicri:Area/Main/Exploration">00A835</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">The Omphalos Context-Free Grammar Learning Competition</title><author><name sortKey="Starkie, Bradford" sort="Starkie, Bradford" uniqKey="Starkie B" first="Bradford" last="Starkie">Bradford Starkie</name><affiliation wicri:level="1"><country xml:lang="fr">Australie</country><wicri:regionArea>Telstra Research Laboratories, 770 Blackburn Rd Clayton, 3127, Melbourne, Victoria</wicri:regionArea><wicri:noRegion>Victoria</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Australie</country></affiliation></author><author><name sortKey="Coste, Francois" sort="Coste, Francois" uniqKey="Coste F" first="François" last="Coste">François Coste</name><affiliation wicri:level="1"><country xml:lang="fr">France</country><wicri:regionArea>IRISA, Campus de Beaulieu, 35042, Rennes</wicri:regionArea><wicri:noRegion>35042, Rennes</wicri:noRegion><wicri:noRegion>Rennes</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author><author><name sortKey="Van Zaanen, Menno" sort="Van Zaanen, Menno" uniqKey="Van Zaanen M" first="Menno" last="Van Zaanen">Menno Van Zaanen</name><affiliation wicri:level="1"><country xml:lang="fr">Pays-Bas</country><wicri:regionArea>Tilburg University, Postbus 90153, 5000 LE, Tilburg</wicri:regionArea><wicri:noRegion>Tilburg</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Pays-Bas</country></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2004</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Algorithm</term><term>Artificial intelligence</term><term>Benchmark inference problems</term><term>Benchmark problems</term><term>Bradford starkie</term><term>Bruteforcelearner</term><term>Bruteforcelearner algorithm</term><term>Candidate grammars</term><term>Center recursion</term><term>Competition problems</term><term>Competition task</term><term>Competition tasks</term><term>Complexity measure</term><term>Context free grammar</term><term>Context free language</term><term>Derivation trees</term><term>Deterministic languages</term><term>Distance measure</term><term>Equal number</term><term>Erik tjong</term><term>Evaluation approach</term><term>Grammar</term><term>Grammatical</term><term>Grammatical inference</term><term>Grammatical inference algorithms</term><term>Grammatical inference problems</term><term>Grammatical inference systems</term><term>Indicative measure</term><term>Inference algorithms</term><term>Inference problems</term><term>International colloquium</term><term>Joan andreu</term><term>Lecture notes</term><term>Longest sentence</term><term>Main disadvantage</term><term>Menno</term><term>More task</term><term>Negative data</term><term>Negative examples</term><term>Negative sentences</term><term>Omphalos</term><term>Omphalos competition</term><term>Omphalos grammar</term><term>Pages berlin heidelberg</term><term>Polynomial time</term><term>Positive data</term><term>Positive examples</term><term>Positive sentences</term><term>Previous section</term><term>Regular approximation</term><term>Regular approximations</term><term>Regular language</term><term>Right hand side</term><term>Statistical distribution</term><term>Suitable measure</term><term>Target grammar</term><term>Target grammars</term><term>Target language</term><term>Telstra research laboratories</term><term>Test data</term><term>Test examples</term><term>Test sentence</term><term>Test sentences</term><term>Test sets</term><term>Testing sets</term><term>Training data</term><term>Training examples</term><term>Training sentences</term><term>Training sets</term><term>Unseen examples</term><term>Unstructured data</term><term>Zaanen</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Grammaire CF</term><term>Inférence grammaticale</term><term>Intelligence artificielle</term><term>Langage CF</term><term>Mesure complexité</term></keywords><keywords scheme="Teeft" xml:lang="en"><term>Algorithm</term><term>Benchmark inference problems</term><term>Benchmark problems</term><term>Bradford starkie</term><term>Bruteforcelearner</term><term>Bruteforcelearner algorithm</term><term>Candidate grammars</term><term>Center recursion</term><term>Competition problems</term><term>Competition task</term><term>Competition tasks</term><term>Complexity measure</term><term>Derivation trees</term><term>Deterministic languages</term><term>Distance measure</term><term>Equal number</term><term>Erik tjong</term><term>Evaluation approach</term><term>Grammar</term><term>Grammatical</term><term>Grammatical inference</term><term>Grammatical inference algorithms</term><term>Grammatical inference problems</term><term>Grammatical inference systems</term><term>Indicative measure</term><term>Inference algorithms</term><term>Inference problems</term><term>International colloquium</term><term>Joan andreu</term><term>Lecture notes</term><term>Longest sentence</term><term>Main disadvantage</term><term>Menno</term><term>More task</term><term>Negative data</term><term>Negative examples</term><term>Negative sentences</term><term>Omphalos</term><term>Omphalos competition</term><term>Omphalos grammar</term><term>Pages berlin heidelberg</term><term>Polynomial time</term><term>Positive data</term><term>Positive examples</term><term>Positive sentences</term><term>Previous section</term><term>Regular approximation</term><term>Regular approximations</term><term>Regular language</term><term>Right hand side</term><term>Statistical distribution</term><term>Suitable measure</term><term>Target grammar</term><term>Target grammars</term><term>Target language</term><term>Telstra research laboratories</term><term>Test data</term><term>Test examples</term><term>Test sentence</term><term>Test sentences</term><term>Test sets</term><term>Testing sets</term><term>Training data</term><term>Training examples</term><term>Training sentences</term><term>Training sets</term><term>Unseen examples</term><term>Unstructured data</term><term>Zaanen</term></keywords><keywords scheme="Wicri" type="topic" xml:lang="fr"><term>Intelligence artificielle</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: This paper describes the Omphalos Context-Free Grammar Learning Competition held as part of the International Colloquium on Grammatical Inference 2004. The competition was created in an effort to promote the development of new and better grammatical inference algorithms for context-free languages, to provide a forum for the comparison of different grammatical inference algorithms and to gain insight into the current state-of-the-art of context-free grammatical inference algorithms. This paper discusses design issues and decisions made when creating the competition. It also includes a new measure of the complexity of inferring context-free grammars, used to rank the competition problems.</div></front></TEI><affiliations><list><country><li>Australie</li><li>France</li><li>Pays-Bas</li></country></list><tree><country name="Australie"><noRegion><name sortKey="Starkie, Bradford" sort="Starkie, Bradford" uniqKey="Starkie B" first="Bradford" last="Starkie">Bradford Starkie</name></noRegion><name sortKey="Starkie, Bradford" sort="Starkie, Bradford" uniqKey="Starkie B" first="Bradford" last="Starkie">Bradford Starkie</name></country><country name="France"><noRegion><name sortKey="Coste, Francois" sort="Coste, Francois" uniqKey="Coste F" first="François" last="Coste">François Coste</name></noRegion><name sortKey="Coste, Francois" sort="Coste, Francois" uniqKey="Coste F" first="François" last="Coste">François Coste</name></country><country name="Pays-Bas"><noRegion><name sortKey="Van Zaanen, Menno" sort="Van Zaanen, Menno" uniqKey="Van Zaanen M" first="Menno" last="Van Zaanen">Menno Van Zaanen</name></noRegion><name sortKey="Van Zaanen, Menno" sort="Van Zaanen, Menno" uniqKey="Van Zaanen M" first="Menno" last="Van Zaanen">Menno Van Zaanen</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Asie/explor/AustralieFrV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00A835 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 00A835 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Asie
|area= AustralieFrV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:F0B6C29F334B3E9B4D717E769FB77011760B3852
|texte= The Omphalos Context-Free Grammar Learning Competition
}}
| This area was generated with Dilib version V0.6.33. |  |